Recently, a standardized framework was proposed for introducing quantum-inspired moves in mathematical games with perfect information and no chance. The beauty of quantum games-succinct in representation, rich in structures, explosive in complexity, dazzling for visualization, and sophisticated for strategic reasoning-has drawn us to play concrete games full of subtleties and to characterize abstract properties pertinent to complexity consequence. Going beyond individual games, we explore the tractability of quantum combinatorial games as whole, and address fundamental questions including: Quantum Leap in Complexity: Are there polynomial-time solvable games whose quantum extensions are intractable? Quantum Collapses in Complexity: Are there PSPACE-complete games whose quantum extensions fall to the lower levels of the polynomial-time hierarchy? Quantumness Matters: How do outcome classes and strategies change under quantum moves? Under what conditions doesn't quantumness matter? PSPACE Barrier for Quantum Leap: Can quantum moves launch PSPACE games into outer polynomial space We show that quantum moves not only enrich the game structure, but also impact their computational complexity. In settling some of these basic questions, we characterize both the powers and limitations of quantum moves as well as the superposition of game configurations that they create. Our constructive proofs-both on the leap of complexity in concrete Quantum Nim and Quantum Undirected Geography and on the continuous collapses, in the quantum setting, of complexity in abstract PSPACE-complete games to each level of the polynomial-time hierarchy-illustrate the striking computational landscape over quantum games and highlight surprising turns with unexpected quantum impact. Our studies also enable us to identify several elegant open questions fundamental to quantum combinatorial game theory (QCGT).

A computer can probably beat you at chess and no one goes anywhere without a GPS. Transhumanist prophet Ray Kurzweil says we will ascend into being computers in a few years (though he also claims solar power will out-produce fossil fuels in a decade, so use caution when he is selling books) but some think it's the other way around, and that humans will instead be the ultimate supercomputers. Danish physicist Jacob Sherson, writing about his beliefs in Nature, said, "It may sound dramatic, but we are currently in a race with technology -- and steadily being overtaken in many areas. Features that used to be uniquely human are fully captured by contemporary algorithms. Our results are here to demonstrate that there is still a difference between the abilities of a man and a machine."

People have an upper hand over artificial intelligence (AI) when it concerns intuitive thinking and solving complex science problems, according to a new study. In the past few decades, the progress in science and technology have enabled scientists to develop AI that beats people at their own games, however the new discovery reveals a different angle. Associate Professor Jacob Sherson from the Aarhus University (AU) in Denmark led a team of researchers to create a quantum computing game based around complex theoretical science. Later on, it was found that computerized numerical optimization failed to find solutions for the tough problems associated with quantum computing tasks, whereas the human players were successful at it. "The big surprise we had was that some of the players actually had solutions that were of higher quality and of shorter duration than any computer algorithms could find," Jacob Sherson said.

We humans may still be licking our wounds following AI's victory at the ancient game of Go, but it turns out we still have something to be proud of: We're doing a lot better than machines are at solving some of the key problems of quantum computing. Quantum mechanics are notoriously mind-bending because so-called "qubits" -- the atomic-scale building blocks of quantum computers -- can inhabit more than one physical state at once. That's known as superposition, and it's what gives the prospect of quantum computers their exciting potential. It's just potential at this point, however, because there are still many, many challenges to be solved before we can create a working quantum computer. That's where gaming comes in.

We humans may still be licking our wounds following AI's victory at the ancient game of Go, but it turns out we still have something to be proud of: We're doing a lot better than machines are at solving some of the key problems of quantum computing. Quantum mechanics are notoriously mind-bending because so-called "qubits" -- the atomic-scale building blocks of quantum computers -- can inhabit more than one physical state at once. That's known as superposition, and it's what gives the prospect of quantum computers their exciting potential. It's just potential at this point, however, because there are still many, many challenges to be solved before we can create a working quantum computer. That's where gaming comes in.

Computers may trounce humans at games like chess and Go, but there's one game we've still got a lock on: quantum physics. Scientists who had people play an online video game that mimicked a troublesome quantum mechanical problem found that the gamers were far better than the computers at working out viable solutions. The findings, published in the journal Nature, offer a surprisingly effective method of dealing with still-puzzling problems in quantum mechanics – and show that artificial intelligence may still have a lot to learn from the power of human intuition. Scientists have been working to develop quantum computers, which takes advantage of the bizarre ways in which matter behaves at the tiniest of scales. Quantum computers have the potential to vastly outstrip the abilities of conventional devices, allowing them to perform a wide range of complex tasks, from cracking encrypted codes to operating self-driving cars.

Scientists have been able to develop artificial intelligence (AI) capable of besting humans at their own games, but a new study suggests that people may have the upper hand when it comes to intuitive thinking. A team of researchers led by Denmark's Aarhus University associate professor Jacob Sherson managed to develop a game based around complex theoretical science in which human players were "able to find solutions to difficult problems associated with the task of quantum computing," whereas computerized numerical optimization failed, according to the scientists' findings published in Nature. "The big surprise we had was that some of the players actually had solutions that were of higher quality and of shorter duration than any computer algorithms could find," Mr. Sherson told the Associated Press. The game, Quantum Moves, is available online for the purpose of helping in the development of quantum computing. While it functions as entertainment, Quantum Moves is built to take quantum physics optimization problems and turn them into a game, the results of which demonstrate fundamental differences between human thought processes and the problem solving of computers.